Adjacency Matrix Representation in Evolutionary Circuit Synthesis
نویسندگان
چکیده
An analog circuit synthesis method based on evolutionary circuit techniques is proposed where the chromosome in the genetic algorithm is coded through the use of adjacency matrices. The method assumes that the circuit is described at the behavioral level in order to reduce the simulation time. It is shown that adjacency matrices coding of the chromosome reduces considerably the number of anomalous circuits generated by the genetic algorithm operations. Moreover the proposed representation enables to easily implement selection criteria to control the topological properties of the circuit.
منابع مشابه
Chromosome Representation through Adjacency Matrix in Evolutionary Circuits Synthesis
The use of adjacency matrices to the chromosome coding in evolutionary circuits techniques is proposed. The approach is shown to overcome some of the drawbacks associated with other coding schemes simplifying the implementation of the evolution process. It is particularly shown that the proposed coding scheme reduces considerably the generation of anomalous circuits increasing the efficiency of...
متن کاملThe machine learning process in applying spatial relations of residential plans based on samples and adjacency matrix
The current world is moving towards the development of hardware or software presence of artificial intelligence in all fields of human work, and architecture is no exception. Now this research seeks to present a theoretical and practical model of intuitive design intelligence that shows the problem of learning layout and spatial relationships to artificial intelligence algorithms; Therefore, th...
متن کاملOn the adjacency matrix of a threshold graph
A threshold graph on n vertices is coded by a binary string of length n − 1. We obtain a formula for the inertia of (the adjacency matrix of) a threshold graph in terms of the code of the graph. It is shown that the number of negative eigenvalues of the adjacency matrix of a threshold graph is the number of ones in the code, whereas the nullity is given by the number of zeros in the code that a...
متن کاملA Graph Based Clustering Method using a Hybrid Evolutionary Algorithm
Clustering of data items is one of the important applications of graph partitioning using a graph model. The pairwise similarities between all data items form the adjacency matrix of a weighted graph that contains all the necessary information for clustering. In this paper we propose a novel hybrid-evolutionary algorithm based on graph partitioning approach for data clustering. The algorithm is...
متن کاملTHE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
متن کامل